The String Barcoding Problem
نویسنده
چکیده
In this paper we consider an approach to solve the string barcoding problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.
منابع مشابه
Algorithmic Perspectives of the String Barcoding Problems
1.1 INTRODUCTION Let Σ be a finite alphabet. A string is a concatenation of elements of Σ. The length of a string x, denoted by |x|, is the number of the characters that constitute this string. Let S be a set of strings over Σ. The simplest " binary-valued version " of the string barcoding problem discussed in this chapter is defined as follows [3, 17]: Problem name: String barcoding problem (S...
متن کاملHighly Scalable Algorithms for Robust String Barcoding
String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper, we describe the engineering of highly scalable algorithms for robust string barcoding. Our methods enable distinguisher selection based on whole genomic sequences of hundreds of microorganisms of up to bacterial size, on a well equipped workstation. Experimental results on both...
متن کاملAlgorithmic Approaches to the String Barcoding Problem
This thesis deals with a heuristic approach based on Lagrangian relaxation to the string barcoding (SB) problem, a close cousin to the well-known combinatorial set cover (SC) problem. It has recently been proven to be NP-hard and has many real-world applications, particularly in the fields of medicine and biology. Given a set of sequences over some alphabet, DNA for instance, we aim at finding ...
متن کاملانتخاب کوچکترین ابر رشته در DNA با استفاده از الگوریتم ازدحام ذرّات
A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) i...
متن کاملFast Kernel Methods for SVM Sequence Classifiers
In this work we study string kernel methods for sequence analysis and focus on the problem of species-level identification based on short DNA fragments known as barcodes. We introduce efficient sorting-based algorithms for exact string k-mer kernels and then describe a divide-and-conquer technique for kernels with mismatches. Our algorithm for the mismatch kernel matrix computation improves cur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012